Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid
نویسندگان
چکیده
In this paper the nodes of the hexagonal grid are used as points. There are 3 types of neighbours on this grid, therefore neighbourhood sequences contain values 1, 2, 3. The grid is coordinatized by three coordinates in a symmetric way. Digital circles are classified based on digital distances using neighbourhood sequences. They can be triangle, hexagon, enneagon and dodecagon. Their corners and side-lengths are computed, such as their perimeters and areas. The radius of a digital disc is usually not well-defined, i.e., the same disc can have various radii according to the neighbourhood sequence used . Therefore the non-compactness ratio is used to measure the quality of approximation of the Euclidean circles. The best approximating neighbourhood sequence is presented. It is shown that the approximation can be improved using two neighbourhood sequences in parallel. Comparisons to other approximations are also shown.
منابع مشابه
Approximating the Euclidean circle in the square grid using neighbourhood sequences
Distance measuring is a very important task in digital geometry and digital image processing. Due to our natural approach to geometry we think of the set of points that are equally far from a given point as a Euclidean circle. Using the classical neighbourhood relations on digital grids, we get circles that greatly differ from the Euclidean circle. In this paper we examine different methods of ...
متن کاملCharacterization of digital circles in triangular grid q
In this paper we present some former results about properties of digital circles defined by neighbourhood sequences in the triangular grid. Das and Chatterji [Inform. Sci. 50 (1990) 123] analyzed the geometric behaviour of twodimensional periodic neighbourhood sequences. We use a more general definition of neighbourhood sequences, which does not require periodicity [Publ. Math. Debrecen 60 (200...
متن کاملGenerating Distance Maps with Neighbourhood Sequences
A sequential algorithm for computing the distance map using distances based on neighbourhood sequences (of any length) in the 2D square grid; and 3D cubic, face-centered cubic, and body-centered cubic grids is presented. Conditions for the algorithm to produce correct results are derived using a path-based approach. Previous sequential algorithms for this task have been based on algorithms that...
متن کاملShortest Paths in Triangular Grids with Neighbourhood Sequences
In this paper we analyse some properties of the triangular and hexagonal grids in the 2D digital space. We define distances based on neighbourhood relations that can be introduced in these grids. We present an algorithm, which calculates the distance from an arbitrary point to another one for a given neighbourhood sequence in the triangular grid. Moreover, this algorithm produces the shortest p...
متن کاملDiscrete Z and Painlevé equations
Circle patterns as discrete analogs of conformal mappings is a fast-developing field of research on the border of analysis and geometry. Recent progress in their investigation was initiated by Thurston’s idea (see [18]) about approximating the Riemann mapping by circle packings. The corresponding convergence was proven by Rodin and Sullivan in [15]. For hexagonal packings, it was established by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 412 شماره
صفحات -
تاریخ انتشار 2011